Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Fast Contour-Tracing Algorithm Based on a Pixel-Following Method for Image Sensors

Identifieur interne : 000007 ( Main/Exploration ); précédent : 000006; suivant : 000008

Fast Contour-Tracing Algorithm Based on a Pixel-Following Method for Image Sensors

Auteurs : Jonghoon Seo ; Seungho Chae ; Jinwook Shim ; Dongchul Kim ; Cheolho Cheong ; Tack-Don Han

Source :

RBID : PMC:4813928

Abstract

Contour pixels distinguish objects from the background. Tracing and extracting contour pixels are widely used for smart/wearable image sensor devices, because these are simple and useful for detecting objects. In this paper, we present a novel contour-tracing algorithm for fast and accurate contour following. The proposed algorithm classifies the type of contour pixel, based on its local pattern. Then, it traces the next contour using the previous pixel’s type. Therefore, it can classify the type of contour pixels as a straight line, inner corner, outer corner and inner-outer corner, and it can extract pixels of a specific contour type. Moreover, it can trace contour pixels rapidly because it can determine the local minimal path using the contour case. In addition, the proposed algorithm is capable of the compressing data of contour pixels using the representative points and inner-outer corner points, and it can accurately restore the contour image from the data. To compare the performance of the proposed algorithm to that of conventional techniques, we measure their processing time and accuracy. In the experimental results, the proposed algorithm shows better performance compared to the others. Furthermore, it can provide the compressed data of contour pixels and restore them accurately, including the inner-outer corner, which cannot be restored using conventional algorithms.


Url:
DOI: 10.3390/s16030353
PubMed: 27005632
PubMed Central: 4813928


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Fast Contour-Tracing Algorithm Based on a Pixel-Following Method for Image Sensors</title>
<author>
<name sortKey="Seo, Jonghoon" sort="Seo, Jonghoon" uniqKey="Seo J" first="Jonghoon" last="Seo">Jonghoon Seo</name>
<affiliation>
<nlm:aff id="af1-sensors-16-00353">Software Platform R&D Lab., LG Electronics Advanced Research Institute, 19 Yangjae-daero 11-gil, Seocho-gu, Seoul, 06772, Korea;
<email>jonghoon.seo@lge.com</email>
</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Chae, Seungho" sort="Chae, Seungho" uniqKey="Chae S" first="Seungho" last="Chae">Seungho Chae</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Shim, Jinwook" sort="Shim, Jinwook" uniqKey="Shim J" first="Jinwook" last="Shim">Jinwook Shim</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Kim, Dongchul" sort="Kim, Dongchul" uniqKey="Kim D" first="Dongchul" last="Kim">Dongchul Kim</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Cheong, Cheolho" sort="Cheong, Cheolho" uniqKey="Cheong C" first="Cheolho" last="Cheong">Cheolho Cheong</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Han, Tack Don" sort="Han, Tack Don" uniqKey="Han T" first="Tack-Don" last="Han">Tack-Don Han</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">PMC</idno>
<idno type="pmid">27005632</idno>
<idno type="pmc">4813928</idno>
<idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4813928</idno>
<idno type="RBID">PMC:4813928</idno>
<idno type="doi">10.3390/s16030353</idno>
<date when="2016">2016</date>
<idno type="wicri:Area/Pmc/Corpus">000029</idno>
<idno type="wicri:Area/Pmc/Curation">000029</idno>
<idno type="wicri:Area/Pmc/Checkpoint">000005</idno>
<idno type="wicri:Area/Ncbi/Merge">000257</idno>
<idno type="wicri:Area/Ncbi/Curation">000257</idno>
<idno type="wicri:Area/Ncbi/Checkpoint">000257</idno>
<idno type="wicri:Area/Main/Merge">000006</idno>
<idno type="wicri:Area/Main/Curation">000007</idno>
<idno type="wicri:Area/Main/Exploration">000007</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a" type="main">Fast Contour-Tracing Algorithm Based on a Pixel-Following Method for Image Sensors</title>
<author>
<name sortKey="Seo, Jonghoon" sort="Seo, Jonghoon" uniqKey="Seo J" first="Jonghoon" last="Seo">Jonghoon Seo</name>
<affiliation>
<nlm:aff id="af1-sensors-16-00353">Software Platform R&D Lab., LG Electronics Advanced Research Institute, 19 Yangjae-daero 11-gil, Seocho-gu, Seoul, 06772, Korea;
<email>jonghoon.seo@lge.com</email>
</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Chae, Seungho" sort="Chae, Seungho" uniqKey="Chae S" first="Seungho" last="Chae">Seungho Chae</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Shim, Jinwook" sort="Shim, Jinwook" uniqKey="Shim J" first="Jinwook" last="Shim">Jinwook Shim</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Kim, Dongchul" sort="Kim, Dongchul" uniqKey="Kim D" first="Dongchul" last="Kim">Dongchul Kim</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Cheong, Cheolho" sort="Cheong, Cheolho" uniqKey="Cheong C" first="Cheolho" last="Cheong">Cheolho Cheong</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
<author>
<name sortKey="Han, Tack Don" sort="Han, Tack Don" uniqKey="Han T" first="Tack-Don" last="Han">Tack-Don Han</name>
<affiliation>
<nlm:aff id="af2-sensors-16-00353">Department of Computer Science, Yonsei University, 50 Yonsei-ro Seodaemun-gu, Seoul, 03722, Korea;
<email>seungho.chae@msl.yonsei.ac.kr</email>
(S.C.);
<email>jin99foryou@msl.yonsei.ac.kr</email>
(J.S.);
<email>dckim@msl.yonsei.ac.kr</email>
(D.K.);
<email>balgeum00@msl.yonsei.ac.kr</email>
(C.C.)</nlm:aff>
</affiliation>
</author>
</analytic>
<series>
<title level="j">Sensors (Basel, Switzerland)</title>
<idno type="eISSN">1424-8220</idno>
<imprint>
<date when="2016">2016</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">
<p>Contour pixels distinguish objects from the background. Tracing and extracting contour pixels are widely used for smart/wearable image sensor devices, because these are simple and useful for detecting objects. In this paper, we present a novel contour-tracing algorithm for fast and accurate contour following. The proposed algorithm classifies the type of contour pixel, based on its local pattern. Then, it traces the next contour using the previous pixel’s type. Therefore, it can classify the type of contour pixels as a straight line, inner corner, outer corner and inner-outer corner, and it can extract pixels of a specific contour type. Moreover, it can trace contour pixels rapidly because it can determine the local minimal path using the contour case. In addition, the proposed algorithm is capable of the compressing data of contour pixels using the representative points and inner-outer corner points, and it can accurately restore the contour image from the data. To compare the performance of the proposed algorithm to that of conventional techniques, we measure their processing time and accuracy. In the experimental results, the proposed algorithm shows better performance compared to the others. Furthermore, it can provide the compressed data of contour pixels and restore them accurately, including the inner-outer corner, which cannot be restored using conventional algorithms.</p>
</div>
</front>
<back>
<div1 type="bibliography">
<listBibl>
<biblStruct>
<analytic>
<author>
<name sortKey="Mcqueen, W A" uniqKey="Mcqueen W">W.A. Mcqueen</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Pratt, W" uniqKey="Pratt W">W. Pratt</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Gose, E" uniqKey="Gose E">E. Gose</name>
</author>
<author>
<name sortKey="Johnsonbaugh, R" uniqKey="Johnsonbaugh R">R. Johnsonbaugh</name>
</author>
<author>
<name sortKey="Jost, S" uniqKey="Jost S">S. Jost</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Pitas, I" uniqKey="Pitas I">I. Pitas</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Das, M" uniqKey="Das M">M. Das</name>
</author>
<author>
<name sortKey="Paulik, M" uniqKey="Paulik M">M. Paulik</name>
</author>
<author>
<name sortKey="Loh, N" uniqKey="Loh N">N. Loh</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Papert, S" uniqKey="Papert S">S. Papert</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Cheong, C" uniqKey="Cheong C">C. Cheong</name>
</author>
<author>
<name sortKey="Han, T D" uniqKey="Han T">T.D. Han</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Pavlidis, T" uniqKey="Pavlidis T">T. Pavlidis</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Reddy, P R" uniqKey="Reddy P">P.R. Reddy</name>
</author>
<author>
<name sortKey="Amarnadh, V" uniqKey="Amarnadh V">V. Amarnadh</name>
</author>
<author>
<name sortKey="Bhaskar, M" uniqKey="Bhaskar M">M. Bhaskar</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Aroca, R V" uniqKey="Aroca R">R.V. Aroca</name>
</author>
<author>
<name sortKey="Gomes, R B" uniqKey="Gomes R">R.B. Gomes</name>
</author>
<author>
<name sortKey="Dantas, R R" uniqKey="Dantas R">R.R. Dantas</name>
</author>
<author>
<name sortKey="Calbo, A G" uniqKey="Calbo A">A.G. Calbo</name>
</author>
<author>
<name sortKey="Goncalves, L M G" uniqKey="Goncalves L">L.M.G. Gonçalves</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Wakaumi, H" uniqKey="Wakaumi H">H. Wakaumi</name>
</author>
<author>
<name sortKey="Nagasawa, C" uniqKey="Nagasawa C">C. Nagasawa</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Brodi, D" uniqKey="Brodi D">D. Brodić</name>
</author>
<author>
<name sortKey="Milivojevi, D R" uniqKey="Milivojevi D">D.R. Milivojević</name>
</author>
<author>
<name sortKey="Milivojevi, Z" uniqKey="Milivojevi Z">Z. Milivojević</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Kim, J H" uniqKey="Kim J">J.H. Kim</name>
</author>
<author>
<name sortKey="Seo, K S" uniqKey="Seo K">K.S. Seo</name>
</author>
<author>
<name sortKey="Wang, J" uniqKey="Wang J">J. Wang</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Tian, Y" uniqKey="Tian Y">Y. Tian</name>
</author>
<author>
<name sortKey="Guan, T" uniqKey="Guan T">T. Guan</name>
</author>
<author>
<name sortKey="Wang, C" uniqKey="Wang C">C. Wang</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Zhang, S" uniqKey="Zhang S">S. Zhang</name>
</author>
<author>
<name sortKey="Zhao, X" uniqKey="Zhao X">X. Zhao</name>
</author>
<author>
<name sortKey="Lei, B" uniqKey="Lei B">B. Lei</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Cheong, C" uniqKey="Cheong C">C. Cheong</name>
</author>
<author>
<name sortKey="Seo, J" uniqKey="Seo J">J. Seo</name>
</author>
<author>
<name sortKey="Han, T D" uniqKey="Han T">T.D. Han</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Miyatake, T" uniqKey="Miyatake T">T. Miyatake</name>
</author>
<author>
<name sortKey="Matsushima, H" uniqKey="Matsushima H">H. Matsushima</name>
</author>
<author>
<name sortKey="Ejiri, M" uniqKey="Ejiri M">M. Ejiri</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Danielsson, P E" uniqKey="Danielsson P">P.E. Danielsson</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Shoji, K" uniqKey="Shoji K">K. Shoji</name>
</author>
<author>
<name sortKey="Miyamichi, J" uniqKey="Miyamichi J">J. Miyamichi</name>
</author>
<author>
<name sortKey="Hirano, K" uniqKey="Hirano K">K. Hirano</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Toussaint, G" uniqKey="Toussaint G">G. Toussaint</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Suzuki, S" uniqKey="Suzuki S">S. Suzuki</name>
</author>
<author>
<name sortKey="Abe, K" uniqKey="Abe K">K. Abe</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Ghuneim, A" uniqKey="Ghuneim A">A. Ghuneim</name>
</author>
</analytic>
</biblStruct>
</listBibl>
</div1>
</back>
</TEI>
<affiliations>
<list></list>
<tree>
<noCountry>
<name sortKey="Chae, Seungho" sort="Chae, Seungho" uniqKey="Chae S" first="Seungho" last="Chae">Seungho Chae</name>
<name sortKey="Cheong, Cheolho" sort="Cheong, Cheolho" uniqKey="Cheong C" first="Cheolho" last="Cheong">Cheolho Cheong</name>
<name sortKey="Han, Tack Don" sort="Han, Tack Don" uniqKey="Han T" first="Tack-Don" last="Han">Tack-Don Han</name>
<name sortKey="Kim, Dongchul" sort="Kim, Dongchul" uniqKey="Kim D" first="Dongchul" last="Kim">Dongchul Kim</name>
<name sortKey="Seo, Jonghoon" sort="Seo, Jonghoon" uniqKey="Seo J" first="Jonghoon" last="Seo">Jonghoon Seo</name>
<name sortKey="Shim, Jinwook" sort="Shim, Jinwook" uniqKey="Shim J" first="Jinwook" last="Shim">Jinwook Shim</name>
</noCountry>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000007 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000007 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     PMC:4813928
   |texte=   Fast Contour-Tracing Algorithm Based on a Pixel-Following Method for Image Sensors
}}

Pour générer des pages wiki

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/RBID.i   -Sk "pubmed:27005632" \
       | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd   \
       | NlmPubMed2Wicri -a OcrV1 

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024